Algebra and Topology in Lambda Calculus
نویسنده
چکیده
The untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the formal foundations of mathematics and logic. Although lambda calculus is a very basic language, it is sufficient to express all the computable functions. The process of application and evaluation reflects the computational behavior of many modern functional programming languages, which explains the interest in the lambda calculus among computer scientists.
منابع مشابه
All Compact Hausdor
The rst mathematical model of the untyped lambda calculus was discovered by DANA SCOTT in the category of algebraic lattices and Scott continuous maps. The question then arises as to which other cartesian closed categories contain a model of the calculus. In this paper we show that any compact Hausdor model of the calculus must satisfy the property that the semantic map from the calculus to the...
متن کاملOn the algebraic models of lambda calculus
The variety (equational class) of lambda abstraction algebras was introduced to algebraize the untyped lambda calculus in the same way Boolean algebras algebraize the classical propositional calculus. The equational theory of lambda abstraction algebras is intended as an alternative to combinatory logic in this regard since it is a rst-order algebraic description of lambda calculus, which allow...
متن کاملExtensional Models of Untyped Lambda-mu Calculus
This paper proposes new mathematical models of the untyped Lambda-mu calculus. One is called the stream model, which is an extension of the lambda model, in which each term is interpreted as a function from streams to individual data. The other is called the stream combinatory algebra, which is an extension of the combinatory algebra, and it is proved that the extensional equality of the Lambda...
متن کاملTopological Incompleteness and Order Incompleteness of the Lambda Calculus
A model of the untyped lambda calculus induces a lambda theory, i.e., a congruence relation on -terms closed under and -conversion. A semantics (= class of models) of the lambda calculus is incomplete if there exists a lambda theory which is not induced by any model in the semantics. In this paper we introduce a new technique to prove the incompleteness of a wide range of lambda calculus semant...
متن کاملApplying Universal Algebra to Lambda Calculus
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untyped λ-calculus) and the models of lambda calculus via universal algebra. This includes positive or negative answers to several questions raised in these years as well as several independent results, the state of the art ...
متن کامل